Triangle-free subgraphs at the triangle-free process
نویسنده
چکیده
We consider the triangle-free process: given an integer n, start by taking a uniformly random ordering of the edges of the complete n-vertex graph Kn. Then, traverse the ordered edges and add each traversed edge to an (initially empty) evolving graph unless its addition creates a triangle. We study the evolving graph at around the time where Θ(n) edges have been traversed for any fixed ε ∈ (0, 10). At that time and for any fixed triangle-free graph F , we give an asymptotically tight estimation of the expected number of copies of F in the evolving graph. For F that is balanced and have density smaller than 2 (e.g., for F that is a cycle of length at least 4), our argument also gives a tight concentration result for the number of copies of F in the evolving graph. Our analysis combines Spencer’s original branching process approach for analysing the triangle-free process and the semi-random method.
منابع مشابه
No Dense Subgraphs Appear in the Triangle-free Graph Process
Consider the triangle-free graph process, which starts from the empty graph on n vertices and in every step an edge is added that is chosen uniformly at random from all non-edges that do not form a triangle with the existing edges. We will show that there exists a constant c such that asymptotically almost surely no copy of any fixed finite triangle-free graph on k vertices with at least ck edg...
متن کاملDynamic concentration of the triangle-free process
The triangle-free process begins with an empty graph on n vertices and iteratively adds edges chosen uniformly at random subject to the constraint that no triangle is formed. We determine the asymptotic number of edges in the maximal triangle-free graph at which the triangle-free process terminates. We also bound the independence number of this graph, which gives an improved lower bound on the ...
متن کاملTriangle-free subgraphs in the triangle-free process
Consider the triangle-free process, which is defined as follows. Start with G(0), an empty graph on n vertices. Given G(i − 1), let G(i) = G(i − 1) ∪ {g(i)}, where g(i) is an edge that is chosen uniformly at random from the set of edges that are not in G(i − 1) and can be added to G(i − 1) without creating a triangle. The process ends once a maximal triangle-free graph has been created. Let H b...
متن کاملColouring vertices of triangle-free graphs without forests
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it is NP-complete in any subclass of triangle-free graphs defined by a finite collection of forbidden induced subgraphs, each of which contains a cycle. In this paper, we study the vertex colouring problem in subclasses of triangle-free graphs obtained by forbidding graphs without cycles, i.e...
متن کاملDensity Conditions For Triangles In Multipartite Graphs
We consider the problem of finding a large or dense triangle-free subgraph in a given graph G. In response to a question of P. Erdős, we prove that, if the minimum degree of G is at least 17|V (G)|/20, the largest triangle-free subgraphs are precisely the largest bipartite subgraphs in G. We investigate in particular the case where G is a complete multipartite graph. We prove that a finite trip...
متن کامل